Solving Diophantine Equations on a Network of Workstations

نویسنده

  • Rizos Sakellariou
چکیده

In 1769, Euler, by generalising Fermat's Last Theorem, conjectured that "it is impossible to exhibit three fourth powers whose sum is a fourth power", "four fifth powers whose sum is a fifth power, and similarly for higher powers". The first counterexample to the conjecture, was found in 1966 after a systematic computer search: 275 +845 + 1105 + 1335 = 1445. More recently, Euler's conjecture was also disproved for fourth powers, and a method of generating an infinity of solutions to the equation A 4 + B 4 + C 4 = D 4 is described in [1]. It is not known whether there are any counterexamples to Euler's conjecture for powers higher than the fifth. The general case of the problem of finding equal sums of like powers, that is, solving the diophantine equation

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Utilizing a new feed-back fuzzy neural network for solving a system of fuzzy equations

This paper intends to offer a new iterative method based on articial neural networks for finding solution of a fuzzy equations system. Our proposed fuzzied neural network is a ve-layer feedback neural network that corresponding connection weights to output layer are fuzzy numbers. This architecture of articial neural networks, can get a real input vector and calculates its corresponding fuzzy o...

متن کامل

Explicit Methods for Solving Diophantine Equations

We give a survey of some classical and modern methods for solving Diophantine equations.

متن کامل

Solving nonlinear Lane-Emden type equations with unsupervised combined artificial neural networks

In this paper we propose a method for solving some well-known classes of Lane-Emden type equations which are nonlinear ordinary differential equations on the semi-innite domain. The proposed approach is based on an Unsupervised Combined Articial Neural Networks (UCANN) method. Firstly, The trial solutions of the differential equations are written in the form of feed-forward neural networks cont...

متن کامل

A Generalized Fibonacci Sequence and the Diophantine Equations $x^2pm kxy-y^2pm x=0$

In this paper some properties of a generalization of Fibonacci sequence are investigated. Then we solve the Diophantine equations $x^2pmkxy-y^2pm x=0$, where $k$ is positive integer, and describe the structure of solutions.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1998